منابع مشابه
The Generation of Fullerenes
We describe an efficient new algorithm for the generation of fullerenes. Our implementation of this algorithm is more than 3.5 times faster than the previously fastest generator for fullerenes - fullgen - and the first program since fullgen to be useful for more than 100 vertices. We also note a programming error in fullgen that caused problems for 136 or more vertices. We tabulate the numbers ...
متن کاملThe topology of fullerenes
Fullerenes are carbon molecules that form polyhedral cages. Their bond structures are exactly the planar cubic graphs that have only pentagon and hexagon faces. Strikingly, a number of chemical properties of a fullerene can be derived from its graph structure. A rich mathematics of cubic planar graphs and fullerene graphs has grown since they were studied by Goldberg, Coxeter, and others in the...
متن کاملthe u.s. policy in central asia and its impact on the colored revolutions in the region (the case study of tulip revolution in kyrgyzstan)
چکیده ندارد.
15 صفحه اولSuperconductivity in the cuprates
We evaluate numerically several superconducting correlation functions in a generalized t − J model derived for hole-doped CuO2 planes. The model includes a three-site term t similar to that obtained in the large U limit of the Hubbard model but of opposite sign for realistic O-O hopping. For realistic parameters we obtain strong evidence of superconductivity of predominantly dx2−y2 character. T...
متن کاملBipartizing fullerenes
A fullerene graph is a cubic bridgeless planar graph with twelve 5-faces such that all other faces are 6-faces. We show that any fullerene graph on n vertices can be bipartized by removing O( √ n) edges. This bound is asymptotically optimal.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science
سال: 1991
ISSN: 0036-8075,1095-9203
DOI: 10.1126/science.254.5034.989